Accurate Eigenvectors of Oscillatory Matrices

نویسنده

  • Plamen Koev
چکیده

The purpose of this report is to investigate the possibilities for accurate computation of eigenvectors of (unsymmetric) oscillatory matrices. The goal is to decide what “accurate” means, to determine whether the eigenvectors are determined “accurately” in that sense, and to engineer algorithms that will guarantee that accuracy. It is desirable for the computed eigenvector matrix to inherit the mathematical properties of eigenvector matrices of oscillatory matrices. Namely, if λ1 > . . . > λn > 0 are the eigenvalues of an oscillatory matrix A, then 1. the jth eigenvector of A has exactly j − 1 sign changes; 2. the eigenvector matrix V is a γ-matrix, i.e., its LU decomposition is V = LU , where L and U−1 are TN. 3. V is an LTP matrix, i.e., V and V −T are lowerly TP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices

We present new O(n3) algorithms that compute eigenvalues and eigenvectors to high relative accuracy in floating point arithmetic for the following types of matrices: symmetric Cauchy, symmetric diagonally scaled Cauchy, symmetric Vandermonde, and symmetric totally nonnegative matrices when they are given as products of nonnegative bidiagonal factors. The algorithms are divided into two stages: ...

متن کامل

A Refined Unsymmetric Lanczos Eigensolver for Computing Accurate Eigentriplets of a Real Unsymmetric Matrix

For most unsymmetric matrices it is difficult to compute many accurate eigenvalues using the primitive form of the unsymmetric Lanczos algorithm (ULA). In this paper we propose a modification of the ULA. It is related to ideas used in [J. Chem. Phys. 122 (2005), 244107 (11 pages)] to compute resonance lifetimes. Using the refined ULA we suggest, the calculation of accurate extremal and interior...

متن کامل

Eigenvectors of block circulant and alternating circulant matrices

The eigenvectors and eigenvalues of block circulant matrices had been found for real symmetric matrices with symmetric submatrices, and for block circulant matrices with circulant submatrices. The eigenvectors are now found for general block circulant matrices, including the Jordan Canonical Form for defective eigenvectors. That analysis is applied to Stephen J. Watson’s alternating circulant m...

متن کامل

On the powers of fuzzy neutrosophic soft matrices

In this paper, ‎The powers of fuzzy neutrosophic soft square matrices (FNSSMs) under the operations $oplus(=max)$ and $otimes(=min)$ are studied‎. ‎We show that the powers of a given FNSM stabilize if and only if its orbits stabilize for each starting fuzzy neutrosophic soft vector (FNSV) and prove a necessary and sufficient condition for this property using the associated graphs of the FNSM‎. ...

متن کامل

The Godunov–Inverse Iteration: A Fast and Accurate Solution to the Symmetric Tridiagonal Eigenvalue Problem

We present a new hybrid algorithm based on Godunov’s method for computing eigenvectors of symmetric tridiagonal matrices and Inverse Iteration, which we call the Godunov–Inverse Iteration. We use eigenvectors computed according to Godunov’s method as starting vectors in the Inverse Iteration, replacing any nonnumeric elements of Godunov’s eigenvectors with random uniform numbers. We use the rig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005